TSTP Solution File: DAT334^21 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : DAT334^21 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:39:08 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   37 (  11 unt;  17 typ;   0 def)
%            Number of atoms       :   65 (   8 equ;   0 cnn)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  159 (  13   ~;   9   |;  14   &; 119   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   34 (  34   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   18 (  16 usr;   9 con; 0-3 aty)
%            Number of variables   :   31 (  18   ^   9   !;   4   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    mworld: $tType ).

thf(decl_22,type,
    mrel: mworld > mworld > $o ).

thf(decl_23,type,
    mactual: mworld ).

thf(decl_24,type,
    mlocal: ( mworld > $o ) > $o ).

thf(decl_26,type,
    mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).

thf(decl_30,type,
    mbox: ( mworld > $o ) > mworld > $o ).

thf(decl_32,type,
    eiw_di: $i > mworld > $o ).

thf(decl_34,type,
    mexists_di: ( $i > mworld > $o ) > mworld > $o ).

thf(decl_35,type,
    cs: $i ).

thf(decl_36,type,
    sue: $i ).

thf(decl_37,type,
    mary: $i ).

thf(decl_38,type,
    john: $i ).

thf(decl_39,type,
    math: $i ).

thf(decl_40,type,
    psych: $i ).

thf(decl_41,type,
    teach: $i > $i > mworld > $o ).

thf(decl_44,type,
    esk3_1: mworld > $i ).

thf(decl_45,type,
    esk4_0: mworld ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',mlocal_def) ).

thf(mbox_def,axiom,
    ( mbox
    = ( ^ [X1: mworld > $o,X3: mworld] :
        ! [X5: mworld] :
          ( ( mrel @ X3 @ X5 )
         => ( X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',mbox_def) ).

thf(mexists_di_def,axiom,
    ( mexists_di
    = ( ^ [X8: $i > mworld > $o,X3: mworld] :
        ? [X6: $i] :
          ( ( eiw_di @ X6 @ X3 )
          & ( X8 @ X6 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',mexists_di_def) ).

thf(mand_def,axiom,
    ( mand
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
          & ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',mand_def) ).

thf(query,conjecture,
    ( mlocal
    @ ( mbox
      @ ( mexists_di
        @ ^ [X6: $i] : ( teach @ X6 @ cs ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',query) ).

thf(db,axiom,
    ( mlocal
    @ ( mbox
      @ ( mand @ ( teach @ john @ math )
        @ ( mand
          @ ( mexists_di
            @ ^ [X6: $i] : ( teach @ X6 @ cs ) )
          @ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p',db) ).

thf(c_0_6,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_def]) ).

thf(c_0_7,plain,
    ( mbox
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
        ! [X5: mworld] :
          ( ( mrel @ Z1 @ X5 )
         => ( Z0 @ X5 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_def]) ).

thf(c_0_8,plain,
    ( mexists_di
    = ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
        ? [X6: $i] :
          ( ( eiw_di @ X6 @ Z1 )
          & ( Z0 @ X6 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mexists_di_def]) ).

thf(c_0_9,plain,
    ( mand
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
          & ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mand_def]) ).

thf(c_0_10,negated_conjecture,
    ~ ! [X19: mworld] :
        ( ( mrel @ mactual @ X19 )
       => ? [X18: $i] :
            ( ( eiw_di @ X18 @ X19 )
            & ( teach @ X18 @ cs @ X19 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]),c_0_6]),c_0_7]),c_0_8]) ).

thf(c_0_11,plain,
    ! [X17: mworld] :
      ( ( mrel @ mactual @ X17 )
     => ( ( teach @ john @ math @ X17 )
        & ? [X16: $i] :
            ( ( eiw_di @ X16 @ X17 )
            & ( teach @ X16 @ cs @ X17 ) )
        & ( teach @ mary @ psych @ X17 )
        & ( teach @ sue @ psych @ X17 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[db]),c_0_6]),c_0_9]),c_0_7]),c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ! [X30: $i] :
      ( ( mrel @ mactual @ esk4_0 )
      & ( ~ ( eiw_di @ X30 @ esk4_0 )
        | ~ ( teach @ X30 @ cs @ esk4_0 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).

thf(c_0_13,plain,
    ! [X27: mworld] :
      ( ( ( teach @ john @ math @ X27 )
        | ~ ( mrel @ mactual @ X27 ) )
      & ( ( eiw_di @ ( esk3_1 @ X27 ) @ X27 )
        | ~ ( mrel @ mactual @ X27 ) )
      & ( ( teach @ ( esk3_1 @ X27 ) @ cs @ X27 )
        | ~ ( mrel @ mactual @ X27 ) )
      & ( ( teach @ mary @ psych @ X27 )
        | ~ ( mrel @ mactual @ X27 ) )
      & ( ( teach @ sue @ psych @ X27 )
        | ~ ( mrel @ mactual @ X27 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).

thf(c_0_14,negated_conjecture,
    ! [X6: $i] :
      ( ~ ( eiw_di @ X6 @ esk4_0 )
      | ~ ( teach @ X6 @ cs @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_15,plain,
    ! [X3: mworld] :
      ( ( teach @ ( esk3_1 @ X3 ) @ cs @ X3 )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_16,negated_conjecture,
    mrel @ mactual @ esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ~ ( eiw_di @ ( esk3_1 @ esk4_0 ) @ esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

thf(c_0_18,plain,
    ! [X3: mworld] :
      ( ( eiw_di @ ( esk3_1 @ X3 ) @ X3 )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : DAT334^21 : TPTP v8.1.2. Released v8.1.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n012.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri May  3 08:34:55 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ShQgJ4DFeT/E---3.1_17010.p
% 0.20/0.50  # Version: 3.1.0-ho
% 0.20/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50  # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.50  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50  # ehoh_best2_full_lfho with pid 17166 completed with status 0
% 0.20/0.50  # Result found by ehoh_best2_full_lfho
% 0.20/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50  # new_ho_10 with pid 17172 completed with status 0
% 0.20/0.50  # Result found by new_ho_10
% 0.20/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 36
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.50  # Initial clauses                      : 31
% 0.20/0.50  # Removed in clause preprocessing      : 21
% 0.20/0.50  # Initial clauses in saturation        : 10
% 0.20/0.50  # Processed clauses                    : 21
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 0
% 0.20/0.50  # ...remaining for further processing  : 21
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 4
% 0.20/0.50  # ...of the previous two non-redundant : 3
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 4
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 2
% 0.20/0.50  # ...of those cached                   : 1
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 11
% 0.20/0.50  #    Positive orientable unit clauses  : 3
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 1
% 0.20/0.50  #    Non-unit-clauses                  : 7
% 0.20/0.50  # Current number of unprocessed clauses: 2
% 0.20/0.50  # ...number of literals in the above   : 4
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 10
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.50  # Unit Clause-clause subsumption calls : 1
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 21
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 1409
% 0.20/0.50  # Search garbage collected termcells   : 262
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.006 s
% 0.20/0.50  # System time              : 0.000 s
% 0.20/0.50  # Total time               : 0.006 s
% 0.20/0.50  # Maximum resident set size: 1856 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.008 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.010 s
% 0.20/0.50  # Maximum resident set size: 1752 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------